Partial Derivative Automaton for Regular Expressions with Shuffle
نویسندگان
چکیده
We generalize the partial derivative automaton to regular expressions with shuffle and study its size in the worst and in the average case. The number of states of the partial derivative automata is in the worst case at most 2m, where m is the number of letters in the expression, while asymptotically and on average it is no more than ( 4 3 )m.
منابع مشابه
Derivatives and Partial Derivatives for Regular Shuffle Expressions
There is a rich variety of shuffling operations ranging from asynchronous interleaving to various forms of synchronizations. We introduce a general shuffling operation which subsumes earlier forms of shuffling. We further extend the notion of a Brzozowski derivative and a Antimirov partial derivative to the general shuffling operation and thus to many earlier forms of shuffling. This extension ...
متن کاملPosition Automaton Construction for Regular Expressions with Intersection
Positions and derivatives are two essential notions in the conversion methods from regular expressions to equivalent finite automata. Partial derivative based methods have recently been extended to regular expressions with intersection. In this paper, we present a position automaton construction for those expressions. This construction generalizes the notion of position making it compatible wit...
متن کاملDerivatives for Regular Shuffle Expressions
There is a rich variety of shuffling operations ranging from asynchronous interleaving to various forms of synchronizations. We introduce a general shuffling operation which subsumes earlier forms of shuffling. We further extend the notion of a Brzozowski derivative to the general shuffling operation and thus to many earlier forms of shuffling. This extension enables the direct construction of ...
متن کاملPartial Derivatives of Regular Expressions and Finite Automaton Constructions
We introduce a notion of partial derivative of a regular expression and apply it to finite automaton constructions. The notion is a generalization of the known notion of word derivative due to Brzozowski: partial derivatives are related to non-deterministic finite automata (NFA’s) in the same natural way as derivatives are related to deterministic ones (DFA’s). We give a constructive definition...
متن کاملOn the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent nondeterministic finite automata (NFA). For practical purposes it is important to study the aver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015